The Phase Transition for Random Subgraphs of the n-cube
نویسندگان
چکیده
We describe recent results, obtained in collaborations with C. Borgs, J.T. Chayes, R. van der Hofstad and J. Spencer, which provide a detailed description of the phase transition for random subgraphs of the n-cube. Résumé. Nous présentons des résultats récents qui donnent une description détaillée de la transition de phase des sous-graphes aléatoires du n-cube. Ces résultats sont obtenus en collaboration avec C. Borgs, J.T. Chayes, R. van der Hofstad et J. Spencer.
منابع مشابه
Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube
We study random subgraphs of the n-cube {0, 1}n, where nearest-neighbor edges are occupied with probability p. Let pc(n) be the value of p for which the expected cluster size of a fixed vertex attains the value λ2n/3, where λ is a small positive constant. In two previous papers, we developed a general theory of random subgraphs of high-dimensional finite connected transitive graphs. In this pap...
متن کاملRandom subgraphs of finite graphs. Part III: The phase transition for the n-cube
We study random subgraphs of the n-cube {0, 1}n, where nearest-neighbor edges are occupied with probability p. Let pc(n) be the value of p for which the expected cluster size of a fixed vertex attains the value λ2n/3, where λ is a small positive constant. Let = n(p − pc(n)). In two previous papers, we showed that the largest cluster inside a scaling window given by | | = Θ(2−n/3) is of size Θ(2...
متن کاملRandom Subgraphs of Finite Graphs. Ii. the Lace Expansion and the Triangle Condition by Christian Borgs,
In a previous paper we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper we use a new and simplified approach to the lac...
متن کاملRandom subgraphs of finite graphs: II. The lace expansion and the triangle condition
In a previous paper, we defined a version of the percolation triangle condition that is suitable for the analysis of bond percolation on a finite connected transitive graph, and showed that this triangle condition implies that the percolation phase transition has many features in common with the phase transition on the complete graph. In this paper, we use a new and simplified approach to the l...
متن کاملRandom subgraphs of finite graphs: I. The scaling window under the triangle condition
We study random subgraphs of an arbitrary finite connected transitive graph G obtained by independently deleting edges with probability 1−p. Let V be the number of vertices in G, and let Ω be their degree. We define the critical threshold pc = pc(G, λ) to be the value of p for which the expected cluster size of a fixed vertex attains the value λV 1/3, where λ is fixed and positive. We show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004